TSTP Solution File: QUA005^1 by Zipperpin---2.1.9999
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Zipperpin---2.1.9999
% Problem : QUA005^1 : TPTP v8.1.2. Released v4.1.0.
% Transfm : NO INFORMATION
% Format : NO INFORMATION
% Command : python3 /export/starexec/sandbox2/solver/bin/portfolio.lams.parallel.py %s %d /export/starexec/sandbox2/tmp/tmp.3aqrf0vXhO true
% Computer : n012.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Aug 31 13:32:23 EDT 2023
% Result : Theorem 1.26s 0.89s
% Output : Refutation 1.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 20
% Syntax : Number of formulae : 43 ( 32 unt; 7 typ; 0 def)
% Number of atoms : 91 ( 52 equ; 0 cnn)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 167 ( 5 ~; 0 |; 20 &; 125 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 34 ( 34 >; 0 *; 0 +; 0 <<)
% Number of symbols : 11 ( 7 usr; 5 con; 0-3 aty)
% ( 5 !!; 12 ??; 0 @@+; 0 @@-)
% Number of variables : 79 ( 51 ^; 20 !; 8 ?; 79 :)
% Comments :
%------------------------------------------------------------------------------
thf(emptyset_type,type,
emptyset: $i > $o ).
thf(singleton_type,type,
singleton: $i > $i > $o ).
thf(zero_type,type,
zero: $i ).
thf(crossmult_type,type,
crossmult: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(sup_type,type,
sup: ( $i > $o ) > $i ).
thf(multiplication_type,type,
multiplication: $i > $i > $i ).
thf('#sk1_type',type,
'#sk1': $i ).
thf(multiplication_anni,conjecture,
! [X1: $i] :
( ( multiplication @ X1 @ zero )
= zero ) ).
thf(zf_stmt_0,negated_conjecture,
~ ! [X1: $i] :
( ( multiplication @ X1 @ zero )
= zero ),
inference('cnf.neg',[status(esa)],[multiplication_anni]) ).
thf(zip_derived_cl8,plain,
~ ( !!
@ ^ [Y0: $i] :
( ( multiplication @ Y0 @ zero )
= zero ) ),
inference(cnf,[status(esa)],[zf_stmt_0]) ).
thf(zip_derived_cl27,plain,
( ( multiplication @ '#sk1' @ zero )
!= zero ),
inference(lazy_cnf_exists,[status(thm)],[zip_derived_cl8]) ).
thf(zip_derived_cl28,plain,
( ( multiplication @ '#sk1' @ zero )
!= zero ),
inference('simplify nested equalities',[status(thm)],[zip_derived_cl27]) ).
thf(singleton_def,axiom,
( singleton
= ( ^ [X: $i,U: $i] : ( U = X ) ) ) ).
thf('0',plain,
( singleton
= ( ^ [X: $i,U: $i] : ( U = X ) ) ),
inference(simplify_rw_rule,[status(thm)],[singleton_def]) ).
thf('1',plain,
( singleton
= ( ^ [V_1: $i,V_2: $i] : ( V_2 = V_1 ) ) ),
define([status(thm)]) ).
thf(sup_singleset,axiom,
! [X: $i] :
( ( sup @ ( singleton @ X ) )
= X ) ).
thf(zf_stmt_1,axiom,
! [X4: $i] :
( ( sup
@ ^ [V_1: $i] : ( V_1 = X4 ) )
= X4 ) ).
thf(zip_derived_cl1,plain,
( !!
@ ^ [Y0: $i] :
( ( sup
@ ^ [Y1: $i] : ( Y1 = Y0 ) )
= Y0 ) ),
inference(cnf,[status(esa)],[zf_stmt_1]) ).
thf(zip_derived_cl19,plain,
! [X2: $i] :
( ( sup
@ ^ [Y0: $i] : ( Y0 = X2 ) )
= X2 ),
inference(lazy_cnf_forall,[status(thm)],[zip_derived_cl1]) ).
thf(zip_derived_cl20,plain,
! [X2: $i] :
( ( sup
@ ^ [Y0: $i] : ( Y0 = X2 ) )
= X2 ),
inference('simplify nested equalities',[status(thm)],[zip_derived_cl19]) ).
thf(emptyset_def,axiom,
( emptyset
= ( ^ [X: $i] : $false ) ) ).
thf('2',plain,
( emptyset
= ( ^ [X: $i] : $false ) ),
inference(simplify_rw_rule,[status(thm)],[emptyset_def]) ).
thf('3',plain,
( emptyset
= ( ^ [V_1: $i] : $false ) ),
define([status(thm)]) ).
thf(sup_es,axiom,
( ( sup @ emptyset )
= zero ) ).
thf(zf_stmt_2,axiom,
( ( sup
@ ^ [V_1: $i] : $false )
= zero ) ).
thf(zip_derived_cl0,plain,
( ( sup
@ ^ [Y0: $i] : $false )
= zero ),
inference(cnf,[status(esa)],[zf_stmt_2]) ).
thf(crossmult_def,axiom,
( crossmult
= ( ^ [X: $i > $o,Y: $i > $o,A: $i] :
? [X1: $i,Y1: $i] :
( ( A
= ( multiplication @ X1 @ Y1 ) )
& ( Y @ Y1 )
& ( X @ X1 ) ) ) ) ).
thf('4',plain,
( crossmult
= ( ^ [X: $i > $o,Y: $i > $o,A: $i] :
? [X1: $i,Y1: $i] :
( ( A
= ( multiplication @ X1 @ Y1 ) )
& ( Y @ Y1 )
& ( X @ X1 ) ) ) ),
inference(simplify_rw_rule,[status(thm)],[crossmult_def]) ).
thf('5',plain,
( crossmult
= ( ^ [V_1: $i > $o,V_2: $i > $o,V_3: $i] :
? [X4: $i,X6: $i] :
( ( V_3
= ( multiplication @ X4 @ X6 ) )
& ( V_2 @ X6 )
& ( V_1 @ X4 ) ) ) ),
define([status(thm)]) ).
thf(multiplication_def,axiom,
! [X: $i > $o,Y: $i > $o] :
( ( multiplication @ ( sup @ X ) @ ( sup @ Y ) )
= ( sup @ ( crossmult @ X @ Y ) ) ) ).
thf(zf_stmt_3,axiom,
! [X4: $i > $o,X6: $i > $o] :
( ( multiplication @ ( sup @ X4 ) @ ( sup @ X6 ) )
= ( sup
@ ^ [V_1: $i] :
? [X8: $i,X10: $i] :
( ( X4 @ X8 )
& ( X6 @ X10 )
& ( V_1
= ( multiplication @ X8 @ X10 ) ) ) ) ) ).
thf(zip_derived_cl5,plain,
( !!
@ ^ [Y0: $i > $o] :
( !!
@ ^ [Y1: $i > $o] :
( ( multiplication @ ( sup @ Y0 ) @ ( sup @ Y1 ) )
= ( sup
@ ^ [Y2: $i] :
( ??
@ ^ [Y3: $i] :
( ??
@ ^ [Y4: $i] :
( ( Y0 @ Y3 )
& ( Y1 @ Y4 )
& ( Y2
= ( multiplication @ Y3 @ Y4 ) ) ) ) ) ) ) ) ),
inference(cnf,[status(esa)],[zf_stmt_3]) ).
thf(zip_derived_cl56,plain,
! [X2: $i > $o] :
( !!
@ ^ [Y0: $i > $o] :
( ( multiplication @ ( sup @ X2 ) @ ( sup @ Y0 ) )
= ( sup
@ ^ [Y1: $i] :
( ??
@ ^ [Y2: $i] :
( ??
@ ^ [Y3: $i] :
( ( X2 @ Y2 )
& ( Y0 @ Y3 )
& ( Y1
= ( multiplication @ Y2 @ Y3 ) ) ) ) ) ) ) ),
inference(lazy_cnf_forall,[status(thm)],[zip_derived_cl5]) ).
thf(zip_derived_cl61,plain,
! [X2: $i > $o,X4: $i > $o] :
( ( multiplication @ ( sup @ X2 ) @ ( sup @ X4 ) )
= ( sup
@ ^ [Y0: $i] :
( ??
@ ^ [Y1: $i] :
( ??
@ ^ [Y2: $i] :
( ( X2 @ Y1 )
& ( X4 @ Y2 )
& ( Y0
= ( multiplication @ Y1 @ Y2 ) ) ) ) ) ) ),
inference(lazy_cnf_forall,[status(thm)],[zip_derived_cl56]) ).
thf(zip_derived_cl66,plain,
! [X2: $i > $o,X4: $i > $o] :
( ( multiplication @ ( sup @ X2 ) @ ( sup @ X4 ) )
= ( sup
@ ^ [Y0: $i] :
( ??
@ ^ [Y1: $i] :
( ??
@ ^ [Y2: $i] :
( ( X2 @ Y1 )
& ( X4 @ Y2 )
& ( Y0
= ( multiplication @ Y1 @ Y2 ) ) ) ) ) ) ),
inference('simplify nested equalities',[status(thm)],[zip_derived_cl61]) ).
thf(zip_derived_cl86,plain,
! [X0: $i > $o] :
( ( multiplication @ ( sup @ X0 ) @ zero )
= ( sup
@ ^ [Y0: $i] :
( ??
@ ^ [Y1: $i] :
( ??
@ ^ [Y2: $i] :
( ( X0 @ Y1 )
& ( ^ [Y3: $i] : $false
@ Y2 )
& ( Y0
= ( multiplication @ Y1 @ Y2 ) ) ) ) ) ) ),
inference('sup+',[status(thm)],[zip_derived_cl0,zip_derived_cl66]) ).
thf(zip_derived_cl96,plain,
! [X0: $i > $o] :
( ( multiplication @ ( sup @ X0 ) @ zero )
= ( sup
@ ^ [Y0: $i] :
( ??
@ ^ [Y1: $i] :
( ??
@ ^ [Y2: $i] :
( ( X0 @ Y1 )
& $false
& ( Y0
= ( multiplication @ Y1 @ Y2 ) ) ) ) ) ) ),
inference(ho_norm,[status(thm)],[zip_derived_cl86]) ).
thf(zip_derived_cl97,plain,
! [X0: $i > $o] :
( ( multiplication @ ( sup @ X0 ) @ zero )
= ( sup
@ ^ [Y0: $i] : $false ) ),
inference('simplify boolean subterms',[status(thm)],[zip_derived_cl96]) ).
thf(zip_derived_cl0_001,plain,
( ( sup
@ ^ [Y0: $i] : $false )
= zero ),
inference(cnf,[status(esa)],[zf_stmt_2]) ).
thf(zip_derived_cl140,plain,
! [X0: $i > $o] :
( ( multiplication @ ( sup @ X0 ) @ zero )
= zero ),
inference(demod,[status(thm)],[zip_derived_cl97,zip_derived_cl0]) ).
thf(zip_derived_cl143,plain,
! [X0: $i] :
( ( multiplication @ X0 @ zero )
= zero ),
inference('sup+',[status(thm)],[zip_derived_cl20,zip_derived_cl140]) ).
thf(zip_derived_cl156,plain,
zero != zero,
inference(demod,[status(thm)],[zip_derived_cl28,zip_derived_cl143]) ).
thf(zip_derived_cl157,plain,
$false,
inference(simplify,[status(thm)],[zip_derived_cl156]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : QUA005^1 : TPTP v8.1.2. Released v4.1.0.
% 0.00/0.13 % Command : python3 /export/starexec/sandbox2/solver/bin/portfolio.lams.parallel.py %s %d /export/starexec/sandbox2/tmp/tmp.3aqrf0vXhO true
% 0.13/0.34 % Computer : n012.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Sat Aug 26 16:36:25 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.13/0.35 % Running portfolio for 300 s
% 0.13/0.35 % File : /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.35 % Number of cores: 8
% 0.13/0.35 % Python version: Python 3.6.8
% 0.13/0.35 % Running in HO mode
% 0.20/0.66 % Total configuration time : 828
% 0.20/0.66 % Estimated wc time : 1656
% 0.20/0.66 % Estimated cpu time (8 cpus) : 207.0
% 0.20/0.69 % /export/starexec/sandbox2/solver/bin/lams/40_c.s.sh running for 80s
% 0.20/0.75 % /export/starexec/sandbox2/solver/bin/lams/35_full_unif4.sh running for 80s
% 0.20/0.75 % /export/starexec/sandbox2/solver/bin/lams/15_e_short1.sh running for 30s
% 0.20/0.76 % /export/starexec/sandbox2/solver/bin/lams/40_c_ic.sh running for 80s
% 0.20/0.77 % /export/starexec/sandbox2/solver/bin/lams/40_noforms.sh running for 90s
% 0.20/0.77 % /export/starexec/sandbox2/solver/bin/lams/40_b.comb.sh running for 70s
% 0.20/0.77 % /export/starexec/sandbox2/solver/bin/lams/30_sp5.sh running for 60s
% 0.20/0.77 % /export/starexec/sandbox2/solver/bin/lams/20_acsne_simpl.sh running for 40s
% 0.20/0.82 % /export/starexec/sandbox2/solver/bin/lams/30_b.l.sh running for 90s
% 1.26/0.89 % Solved by lams/35_full_unif4.sh.
% 1.26/0.89 % done 22 iterations in 0.083s
% 1.26/0.89 % SZS status Theorem for '/export/starexec/sandbox2/benchmark/theBenchmark.p'
% 1.26/0.89 % SZS output start Refutation
% See solution above
% 1.26/0.89
% 1.26/0.89
% 1.26/0.89 % Terminating...
% 1.80/0.95 % Runner terminated.
% 1.80/0.96 % Zipperpin 1.5 exiting
%------------------------------------------------------------------------------